Exchange operator formalism for N-body spin models with near-neighbors interactions

We present a detailed analysis of the spin models with near-neighbors interactions constructed in our previous paper [Phys. Lett. B 605 (2005) 214] by a suitable generalization of the exchange operator formalism. We provide a complete description of a certain flag of finite-dimensional spaces of spin functions preserved by the Hamiltonian of each model. By explicitly diagonalizing the Hamiltonian in the latter spaces, we compute several infinite families of eigenfunctions of the above models in closed form in terms of generalized Laguerre and Jacobi polynomials.Comment: RevTeX, 31 pages, no figures; important additional conten

New spin Calogero-Sutherland models related to B_N-type Dunkl operators

We construct several new families of exactly and quasi-exactly solvable BC_N-type Calogero-Sutherland models with internal degrees of freedom. Our approach is based on the introduction of two new families of Dunkl operators of B_N type which, together with the original B_N-type Dunkl operators, are shown to preserve certain polynomial subspaces of finite dimension. We prove that a wide class of quadratic combinations involving these three sets of Dunkl operators always yields a spin Calogero-Sutherland model, which is (quasi-)exactly solvable by construction. We show that all the spin Calogero-Sutherland models obtainable within this framework can be expressed in a unified way in terms of a Weierstrass P function with suitable half-periods. This provides a natural spin counterpart of the well-known general formula for a scalar completely integrable potential of BC_N type due to Olshanetsky and Perelomov. As an illustration of our method, we exactly compute several energy levels and their corresponding wavefunctions of an elliptic quasi-exactly solvable potential for two and three particles of spin 1/2.Comment: 18 pages, typeset in LaTeX 2e using revtex 4.0b5 and the amslatex package Minor changes in content, one reference adde

Parikh Image of Pushdown Automata

We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \geq 2n + 4$ stack symbols that accepts one single long word for which every equivalent context-free grammar needs $\Omega(n^2(p-2n-4))$ variables. This family shows that the classical algorithm for converting a PDA to an equivalent context-free grammar is optimal even when the alphabet is unary. Moreover, we observe that language equivalence and Parikh equivalence, which ignores the ordering between symbols, coincide for this family. We conclude that, when assuming this weaker equivalence, the conversion algorithm is also optimal. Second, Parikh's theorem motivates the comparison of PDAs against finite state automata. In particular, the same family of unary PDAs gives a lower bound on the number of states of every Parikh-equivalent finite state automaton. Finally, we look into the case of unary deterministic PDAs. We show a new construction converting a unary deterministic PDA into an equivalent context-free grammar that achieves best known bounds.Comment: 17 pages, 2 figure

Zero-temperature generalized phase diagram of the 4d transition metals under pressure

We use an accurate implementation of density functional theory (DFT) to calculate the zero-temperature generalized phase diagram of the 4$d$ series of transition metals from Y to Pd as a function of pressure $P$ and atomic number $Z$. The implementation used is full-potential linearized augmented plane waves (FP-LAPW), and we employ the exchange-correlation functional recently developed by Wu and Cohen. For each element, we obtain the ground-state energy for several crystal structures over a range of volumes, the energy being converged with respect to all technical parameters to within $\sim 1$ meV/atom. The calculated transition pressures for all the elements and all transitions we have found are compared with experiment wherever possible, and we discuss the origin of the significant discrepancies. Agreement with experiment for the zero-temperature equation of state is generally excellent. The generalized phase diagram of the 4$d$ series shows that the major boundaries slope towards lower $Z$ with increasing $P$ for the early elements, as expected from the pressure induced transfer of electrons from $sp$ states to $d$ states, but are almost independent of $P$ for the later elements. Our results for Mo indicate a transition from bcc to fcc, rather than the bcc-hcp transition expected from $sp$-$d$ transfer.Comment: 28 pages and 10 figures. Submitted to Phys. Rev.

Proving Safety with Trace Automata and Bounded Model Checking

Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces redundant execution traces which may complicate the verification of the program. This holds particularly true for verification tools based on Bounded Model Checking, which incorporate simplistic heuristics to determine whether all feasible iterations of a loop have been considered. We present a technique that uses \emph{trace automata} to eliminate redundant executions after performing loop acceleration. The method reduces the diameter of the program under analysis, which is in certain cases sufficient to allow a safety proof using Bounded Model Checking. Our transformation is precise---it does not introduce false positives, nor does it mask any errors. We have implemented the analysis as a source-to-source transformation, and present experimental results showing the applicability of the technique

Personenmarken erfolgreich managen : ein markenpersönlichkeitsbasierter Steuerungsansatz

Personen, wie beispielsweise Sportler, Politiker, Künstler oder Manager, die ihre Leistungen und zunehmend auch sich selb st vermarkten, können als Marken verstanden werden. Ähnlich wie Gütermarken stehen auch Personenmarken immer häufiger vor der Herausforderung, durch eine erfolgreiche Differenzierung im Verdrängungswettbewerb zu bestehen. Trotz ihres enormen wirtschaftlichen Potenzials existiert für Personenmarken bislang kein systematischer Ansatz zur Differenzierung gegenüber der Konkurrenz und somit auch keine Grundlage für ihre effektive Vermarktung. Im vorliegenden Beitrag wird daher zunächst dargestellt, dass das Konzept der Marke auf Personen übertragen und der im Gütermarketing erfolgreich eingesetzte Differenzierungsansatz der Markenpersönlichkeit auch im Kontext von Personenmarken angewendet werden kann. In einem weiteren Schritt werden die im Rahmen einer empirischen Studie ermittelten Einflussfaktoren der Markenpersönlichkeit von Personenmarken vorgestellt und ihre Einsatzmöglichkeiten für ein effektives strategisches Management von Personenmarken beschrieben